Revealing Encryption for Partial Ordering
نویسندگان
چکیده
We generalize the cryptographic notion of Order Revealing Encryption (ORE) to arbitrary functions and we present a construction that allows to determine the (partial) ordering of two vectors i.e., given E(x) and E(y) it is possible to learn whether x ≥ y, y ≥ x or whether x and y are incomparable. This is the first non-trivial example of a Revealing Encryption (RE) scheme with output larger than one bit, and which does not rely on cryptographic obfuscation or multilinear maps.
منابع مشابه
How Low Can You Go? Short Structure-Preserving Signatures for Diffie-Hellman Vectors
We generalize the cryptographic notion of Order Revealing Encryption (ORE) to arbitrary functions and we present a construction that allows to determine the (partial) ordering of two vectors i.e., given E(x) and E(y) it is possible to learn whether x = y, x > y, x < y or whether x and y are incomparable. This is the first non-trivial example of a Revealing Encryption (RE) scheme with output lar...
متن کاملOrder-Revealing Encryption and the Hardness of Private Learning
An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. We show how to use order-revealing encryption to separate computationally efficient PAC learning from efficient (ε, δ)-differentially private PAC learning. That is, we construct a concept class that is efficiently PAC learnable, but for wh...
متن کاملNegations and aggregation operators based on a new hesitant fuzzy partial ordering
Based on a new hesitant fuzzy partial ordering proposed by Garmendia et al.~cite{GaCa:Pohfs}, in this paper a fuzzy disjunction ${D}$ on the set ${H}$ of finite and nonempty subsets of the unit interval and a t-conorm ${S}$ on the set $bar{{B}}$ of equivalence class on the set of finite bags of unit interval based on this partial ordering are introduced respectively. Then, hesitant fuzzy negati...
متن کاملSeller cheap talk in common value auctions ∗
Sellers benefit on average from revealing information about their goods to buyers, but the incentive to exaggerate undermines the credibility of seller statements. When multiple goods are being auctioned, we show that revealing a complete or partial ordering of the different goods by value can be credible. Ordinal cheap talk of this form is not susceptible to exaggeration because it simultaneou...
متن کاملA Partially Order-Preserving Index Scheme
It has become advantageous in certain scenarios for a database owner to outsource hosting and management of his database to a third party. This approach is known as database as a service or DAS. However, in the case of highly sensitive data, it may be necessary to protect it even from the third party database administrator. As a result, several methods have been proposed that allow for encrypti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016